Balancing Tradeoffs in Network Queue Management Problem via Forward–Backward Sweeping with Finite Checkpoints

Network queue management can be modelled as an optimal control problem and is aimed at controlling the dropping rate, in which state variables are instantaneous length respectively. One way to solve it by using indirect method, namely forward–backward sweeping based on Pontryagin minimum principle derive trajectory of rate. However, there exists some performance balance issues network queue, such memory usage versus runtime algorithm, or rate length. Many researchers have exploited symmetry for constrained systems, controllers, model predictive problems achieve exponential reduction simple, intuitive controllers. In this article, we introduce integration checkpointing method into address balancing issues. Specifically, exploit revolve algorithm choose a finite number checkpoints reduce complexity. Both numerical simulation results popular simulator (ns-2) provided through two experiments: varying bandwidth offered load, solidify our proposal comparison other deployed algorithms.